Algorithmic Problems in Optimal Transportation
نویسنده
چکیده
In this document, I outline a few challenging algorithmic problems arising in my research on optimal transportation. I have attempted to pose these problems in “discrete” language. It easily could be the case that they admit straightforward solutions— which is great news!—or that you can do little more than the obvious algorithm. Any and all guidance from members of the theory community is welcome.
منابع مشابه
Algorithmic Solutions to Some Transportation Optimization Problems with Applications in the Metallurgical Industry
In this paper we address several constrained transportation optimization problems (e.g. vehicle routing, shortest Hamiltonian path), for which we present novel algorithmic solutions and extensions, considering several optimization objectives, like minimizing costs and resource usage. All the considered problems are motivated by practical situations arising, for instance, in the mining and metal...
متن کاملA New Approach for Finding an Optimal Solution for Grey Transportation Problem
In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...
متن کاملProfit intensity criterion for transportation problems
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...
متن کامل1 Shortest Path Algorithms in Transportation models :
Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is transportation, where shortest path problems of different kinds need to be solved. Due to the nature of the application, transportation scientists need very flexible and efficient shortest path procedures, both from the running time point of vi...
متن کاملAlgorithmic Decision Theory within Discrete Complex Networks
Algorithmic decision theory becomes more and more important. We will present a theoretical and practical point of view to the role of networks and dynamic flow problems in complex environments. To support a decision support management a comfortable software implementation for solving multiobjective discrete control and dynamic flow problems on networks will be presented. As many processes from ...
متن کامل